Axiomatic characterization of PageRank

This paper examines the fundamental problem of identifying most important nodes in a network. To date, more than hundred centrality measures have been proposed, each evaluating position node network from different perspective. Our work focuses on PageRank which is one computer science used wide range scientific applications. build theoretical foundation for choosing (or rejecting) specific setting, we propose to use an axiomatic approach. Specifically, six simple properties and prove that only measure satisfies all them. In this way, provide first characterization its general form.